Local Update Schemes for Cellular Automata in Structural Design

This paper investigates original local update schemes for Cellular Automata (CA) in structural design. Local problems based on mathematical programming and optimality criteria are tested, allowing the isolation of an original local update scheme. The scheme consists of repeating analysis and optimality-based design rules locally. Several systematic experiments on various problem sizes are performed to show the efficiency and robustness of the approach. For comparison, the experiments are also run using a more traditional CA implementation.